Fading magic of maze procedure Pankaj

نویسنده

  • Pankaj Kumar Mishra
چکیده

I read with interest a recent article by Reston and Shuhaiber [1] where they have analysed the reported clinical outcome of maze-related surgical procedures for intractable atrial fibrillation (AF). I congratulate them for this excellent meta-analysis [1]. I would like to add a few comments. Maze procedure is an excellent example of a technique which was grabbed by an impatient scientific community which believes in evidence-based practice but easily accepts and gets carried away by camouflaged data. As appropriately pointed out by Reston and Shuhaiber [1], the literature evaluating the clinical outcomes after maze procedure suffers from several shortcomings, particularly small sample sizes and selection bias. I would like to add (without daring to elaborate any further!) here a publications bias as well. Maze-related procedures might be helpful in eliminating AF, but the long-term benefits in terms of mortality, morbidity and quality of life is yet to be proved. Most of us tend to forget that Cox et al. described this procedure after performing most of the maze surgeries in patients with lone AF and not those with valvular heart disease. Besides, the classical Cox maze procedure is technically complex, time consuming and leads to an increased rate of postoperative bleeding and need for permanent pacemakers. This led to several simpler modifications. In the absence of randomised controlled trials comparing the efficacy and/or utility of these procedures, we are suffering from tubular vision—everybody is seeing and finding what he or she wants to see in the statistical data presented. This meta-analysis identified only four randomised studies out of which two studies had noncomparable patient groups [1]. Furthermore, a closer look reveals that two of these studies used radiofrequency ablation (RF). Data obtained from RF procedures cannot be compared to any other surgical technique as RF has got some unique advantages such as decreased incidence of postoperative bleeding. Apart from the outcomes which the authors have addressed in their meta-analysis, it will be interesting to know the impact of various techniques on AF recurrence rate, left ventricular systolic function and the quality of life.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Magic Tutorial #10: The Interactive Router

The Magic interactive router, Irouter, provides an interactive interface to Magic’s internal maze router. It is intended as an aid to manual routing. Routing is done one connection at a time, the user specifying a starting point and destination areas prior to each connection. The user determines the order in which signals are routed and how multi-point nets are decomposed into point-to-area con...

متن کامل

$Z_k$-Magic Labeling of Some Families of Graphs

For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic}  if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$  defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$  the group of integers modulo $k...

متن کامل

AMOUR-generalized multicarrier transceivers for blind CDMA regardless of multipath

Suppression of multiuser interference (MUI) and mitigation of multipath effects constitute major challenges in the design of thirdgeneration wireless mobile systems. Most wideband and multicarrier uplink CDMA schemes suppress MUI statistically in the presence of unknown multipath. For fading resistance, they all rely on transmitor receivediversity and multichannel equalization based on bandwidt...

متن کامل

Mixed cycle-E-super magic decomposition of complete bipartite graphs

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) +  ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...

متن کامل

Mixed cycle-E-super magic decomposition of complete bipartite graphs

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006